- subtree key
- ключ поддерева
Англо-русский словарь по вычислительной технике и информационным технологиям - 4-е изд.. Сергей Орлов .
subtree key
Смотреть что такое "subtree key" в других словарях:
Reticulation (single-access key) — In biology, a reticulation of a single access identification key connects different branches of the identification tree to improve error tolerance and identification success [Osborne, D. V. 1963. Some Aspects of the theory of dichotomous keys.… … Wikipedia
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
Enfilade (Xanadu) — Enfilades are a class of tree data structures used in Project Xanadu designs of the 1970s and 1980s. Enfilades allow quick editing, versioning, retrieval and inter comparison operations in a large, cross linked hypertext database. The Xanadu Gold … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
Van Emde Boas tree — A van Emde Boas tree (or van Emde Boas priority queue), also known as a vEB tree, is a tree data structure which implements an associative array with m bit integer keys. It performs all operations in O(log m ) time. Notice that m is the size of… … Wikipedia
B-tree — In computer science, a B tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time. It is most commonly used in databases and filesystems. In B trees, internal (non leaf)… … Wikipedia
Scapegoat tree — In computer science, a scapegoat tree is a self balancing binary search tree, invented by Igal Galperin and Ronald L. Rivest. It provides worst case O(log n ) lookup time, and O(log n ) amortized insertion and deletion time.Unlike other self… … Wikipedia
Red-black tree — A red black tree is a type of self balancing binary search tree, a data structure used in computer science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer who called them symmetric… … Wikipedia
Pairing heap — Pairing heaps are a type of heap data structure with relatively simple implementation and excellent practical amortized performance. However, it has proven very difficult to determine the precise asymptotic running time of pairing heaps.Pairing… … Wikipedia
Lightweight Directory Access Protocol — The Lightweight Directory Access Protocol (LDAP; /ˈɛld … Wikipedia
Biconnected component — Each color corresponds to a biconnected component. Multi colored vertices are cut vertices, and thus belong to multiple biconnected components. In graph theory, a biconnected component (or 2 connected component) is a maximal biconnected subgraph … Wikipedia
